A new upper bound for the multiple knapsack problem
نویسندگان
چکیده
Abstract In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on idea of relaxing MKP to Bounded Sequential Problem, i.e., multiple knapsack problem in which item sizes are divisible. Such relaxation, called sequential obtained by suitably replacing items instance with divisible sizes. Experimental results benchmark instances show that effective, terms quality, when ratio between number and knapsacks small.
منابع مشابه
A new upper bound for the bipartite Ramsey problem
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In the late seventies, Irving [5] showed that it was sufficient, for k large, that n ≥ 2k−1(k−1)−1. Here we improve upon this bound, showing that it is sufficient to take n ≥ (1 + o(1))2 log k, where the log is taken to the...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملHeuristics for multiple knapsack problem
The Multiple Knapsack problem (MKP) is a hard combinatorial optimization problem with large application, which embraces many practical problems from different domains, like cargo loading, cutting stock, bin-packing, financial and other management, etc. It also arise as a subproblem in several more complex problems like vehicle routing problem and the algorithms to solve these problems will bene...
متن کاملA Branch and Bound Algorithm for the Knapsack Problem
A branch and bound algorithm for solution of the "knapsack problem," max E vzix where E wixi < W and xi = 0, 1, is presented which can obtain either optimal or approximate solutions. Some characteristics of the algorithm are discussed and computational experience is presented. Problems involving 50 items from which approximately 25 items were loaded were solved in an average of 0.07 minutes eac...
متن کاملNew upper bound for the #3-SAT problem
We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms. The algorithm achieves a running time of O(1.6423) in the worst case which improves the current best bound of O(1.6737) by Dahllöf et al.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2021.105210